Evolutionary Hypergraph Partitioning
نویسندگان
چکیده
The hypergraph partitioning problem has many applications like processor load balance or VLSI design. For most applications solution quality is crucial. Since the problem is NP-hard, heuristics and meta heuristics are used in practice to solve the problem. In this thesis we combine the commonly used multilevel heuristic with an evolutionary algorithm. Experimental results show that our new algorithm improves solution quality by 2.2% on average. Moreover, it computes the best solutions on 597 out of 630 instances.
منابع مشابه
Evolutionary n-level Hypergraph Partitioning with Adaptive Coarsening
Hypergraph partitioning is an NP-hard problem that occurs in many computer science applications where it is necessary to reduce large problems into a number of smaller, computationally tractable sub-problems, with the consequent desire that these should be as independent as possible to reduce the inevitable side-effects of not taking a global approach. Current techniques use a multilevel approa...
متن کاملRelaxation-Based Coarsening for Multilevel Hypergraph Partitioning
Multilevel partitioning methods that are inspired by principles of multiscaling are the most powerful practical hypergraph partitioning solvers. Hypergraph partitioning has many applications in disciplines ranging from scientific computing to data science. In this paper we introduce the concept of algebraic distance on hypergraphs and demonstrate its use as an algorithmic component in the coars...
متن کاملHypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication
ÐIn this work, we show that the standard graph-partitioning-based decomposition of sparse matrices does not reflect the actual communication volume requirement for parallel matrix-vector multiplication. We propose two computational hypergraph models which avoid this crucial deficiency of the graph model. The proposed models reduce the decomposition problem to the well-known hypergraph partition...
متن کاملRevisiting Hypergraph Models for Sparse Matrix Partitioning
We provide an exposition of hypergraph models for parallelizing sparse matrix-vector multiplies. Our aim is to emphasize the expressive power of hypergraph models. First, we set forth an elementary hypergraph model for parallel matrix-vector multiply based on one-dimensional (1D) matrix partitioning. In the elementary model, the vertices represent the data of a matrix-vector multiply, and the n...
متن کاملDecomposing Irregularly Sparse Matrices for Parallel Matrix-Vector Multiplication
In this work we show the de ciencies of the graph model for decomposing sparse matrices for parallel matrix vector multiplica tion Then we propose two hypergraph models which avoid all de cien cies of the graph model The proposed models reduce the decomposition problem to the well known hypergraph partitioning problem widely en countered in circuit partitioning in VLSI We have implemented fast ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017